Lecture 16 : Property Testing of Functions , Junta Testing
نویسنده
چکیده
• An input f : [n]→ [M ] is equivalent to our usual input x1, . . . , xn where xi = f(i). • A Boolean function f : {0, 1} → {0, 1}. Note that the size of the input table is huge as a function of n. We can think of f as being given by a black box that allows us to evaluate f or in a form that we have to go out and collect. • More generally, a function f : Ω → Z, where Ω is some finite set. • f : G→ R, where G is some group.
منابع مشابه
Distribution-free Junta Testing
We study the problem of testing whether an unknown n-variable Boolean function is a k-junta in the distribution-free property testing model, where the distance between functions is measured with respect to an arbitrary and unknown probability distribution over {0, 1}n. Our first main result is that distribution-free k-junta testing can be performed, with one-sided error, by an adaptive algorith...
متن کاملLecture Notes on Testing by Implicit Sampling
Building on the junta tester, we present a general methodology for constructing testers for properties of Boolean functions (of the form f : {0, 1} → {0, 1}) that can be approximated by small juntas. This methodology yields testers of low query complexity for many natural properties, which contain functions that depend on relatively few relevant variables; specifically, the query complexity is ...
متن کاملTesting Juntas (draft)
A function on n variables is called a k-junta if it depends on at most k of its variables. The problem of testing whether a function is a k-junta or is “far” from being a k-junta is a central problem in property testing and is closely related to the problem of learning high-dimensional data. In this note, we give an informal presentation of three recent algorithms for testing juntas efficiently.
متن کاملTHE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING The Zandman-Slaner Graduate School of Engineering TOPICS IN PROPERTY TESTING AND SUBLINEAR ALGORITHMS
In this work we study several topics in sublinear algorithms, focusing mostly on the field of property testing. Property testing is concerned with deciding whether an object has a certain property or is “far” from every object with that property. Typical property testing algorithms are randomized, and perform queries regarding local properties of the object. The first set of results we present ...
متن کاملCS 369 E : Communication Complexity ( for Algorithm Designers ) Lecture # 8 : Lower Bounds in Property Testing ∗
We begin in this section with a brief introduction to the field of property testing. Section 2 explains the famous example of “linearity testing.” Section 3 gives upper bounds for the canonical problem of “monotonicity testing,” and Section 4 shows how to derive property testing lower bounds from communication complexity lower bounds. These lower bounds will follow from our existing communicati...
متن کامل